On structuring proof search for first order linear logic
نویسندگان
چکیده
منابع مشابه
On Structuring Proof Search for First Order Linear Logic
Full first order linear logic can be presented as an abstract logic programming language in Miller’s system Forum, which yields a sensible operational interpretation in the ‘proof search as computation’ paradigm. However, Forum still has to deal with syntactic details that would normally be ignored by a reasonable operational semantics. In this respect, Forum improves on Gentzen systems for lin...
متن کاملProof Theory for First Order Lukasiewicz Logic
An approximate Herbrand theorem is proved and used to establish Skolemization for first-order Łukasiewicz logic. Proof systems are then defined in the framework of hypersequents. In particular, extending a hypersequent calculus for propositional Łukasiewicz logic with usual Gentzen quantifier rules gives a calculus that is complete with respect to interpretations in safe MV-algebras, but lacks ...
متن کاملProof Planning for First-Order Temporal Logic
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal Logic (FOLTL), which can be seen as a quantified version of Linear Temporal Logic, overcoming its finitary limitation. Automated reasoning in FOLTL is hard, since it is non-recursively enumerable; but its expressivenes...
متن کاملFoundational Proof Certificates in First-Order Logic
It is the exception that provers share and trust each others proofs. One reason for this is that different provers structure their proof evidence in remarkably different ways, including, for example, proof scripts, resolution refutations, tableaux, Herbrand expansions, natural deductions, etc. In this paper, we propose an approach to foundational proof certificates as a means of flexibly presen...
متن کاملProof search strategies in linear logic
Linear logic is a refinement of classical logic introduced by J.-Y.Girard to provide means for keeping track of "resources" two assumptions of a formula A are distinguished from a single assumption of A. Although linear logic is not the first attempt for developing "resourceoriented" logics (relevance logic and Lambek calculus being well-known examples), it is by now the mostinvestigated one. S...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.11.047